An efficient decoding technique for Huffman codes
نویسندگان
چکیده
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [Inform. Process. Lett. 69 (1999) 119–122]. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Hardware Implementation of A Power Efficient Huffman Decoding
Data compression plays an important role in multimedia communication. A major compression technique is performed by converting the fixed-length codes to variable-length codes. Huffman coding is demonstrated to be a very efficient coding scheme and has been widely adopted. However, the variable-length codes increase the difficulties of fast decoding. In addition, the variable decoding time is no...
متن کاملDecoding prefix codes
Minimum-redundancy prefix codes have been a mainstay of research and commercial compression systems since their discovery by David Huffman more than 50 years ago. In this experimental evaluation we compare techniques for decoding minimum-redundancy codes, and quantify the relative benefits of recently developed restricted codes that are designed to accelerate the decoding process. We find that ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملParallel Huffman Decoding
A simple parallel algorithm for decoding a Huuman encoded le is presented , exploiting the tendency of Huuman codes to resynchronize quickly in most cases. An extention to JPEG decoding is mentioned.
متن کاملBit-Based Joint Source-Channel Decoding of Huffman Encoded Markov Multiple Sources
Multimedia transmission over time-varying channels such as wireless channels has recently motivated the research on the joint source-channel technique. In this paper, we present a method for joint source-channel soft decision decoding of Huffman encoded multiple sources. By exploiting the a priori bit probabilities in multiple sources, the decoding performance is greatly improved. Compared with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 81 شماره
صفحات -
تاریخ انتشار 2002